An orthogonal equivalence theorem for third order tensors

نویسندگان

چکیده

<p style='text-indent:20px;'>In 2011, Kilmer and Martin proposed tensor singular value decomposition (T-SVD) for third order tensors. Since then, T-SVD has applications in low rank approximation, recovery, multi-view clustering, feature extraction, sketching, etc. By going through the Discrete Fourier Transform (DFT), matrix SVD inverse DFT, a is mapped to an f-diagonal tensor. We call this Kilmer-Martin mapping. show that mapping of invariant if taking T-product with some orthogonal define values T-rank based upon its Thus, tubal rank, T-rank, T-singular are when it Some properties values, best one approximation discussed.</p>

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Factorization Strategies for Third-order Tensors

Operations with tensors, or multiway arrays, have become increasingly prevalent in recent years. Traditionally, tensors are represented or decomposed as a sum of rank-1 outer products using either the CANDECOMP/PARAFAC (CP) or the Tucker models, or some variation thereof. Such decompositions are motivated by specific applications where the goal is to find an approximate such representation for ...

متن کامل

An Equivalence Theorem for Series of Orthogonal Polynomials.

xj(u, v) = yj(u, v), j = 1, 2, 3, so that again (8) holds. Hence, under our hypotheses, D is mapped isothermically on a spherical surface of finite radius, and circles are not mapped on circles. III. Characterization of Those Isothermic Spherical Maps Which Map Circles on Circles and of Isothermic Maps on Minimal Surfaces.-THEOREM 3. If thefunctions (6) have continuous partial derivatives of th...

متن کامل

A Third-order Generalization of the Matrix Svd as a Product of Third-order Tensors

Abstract. Traditionally, extending the Singular Value Decomposition (SVD) to third-order tensors (multiway arrays) has involved a representation using the outer product of vectors. These outer products can be written in terms of the n-mode product, which can also be used to describe a type of multiplication between two tensors. In this paper, we present a different type of third-order generaliz...

متن کامل

Orthogonal Rank Decompositions for Tensors

The theory of orthogonal rank decompositions for matrices is well understood, but the same is not true for tensors. For tensors, even the notions of orthogonality and rank can be interpreted several diierent ways. Tensor decompositions are useful in applications such as principal component analysis for multiway data. We present two types of orthogonal rank decompositions and describe methods to...

متن کامل

Computing the polyadic decomposition of nonnegative third order tensors

Computing the minimal polyadic decomposition (also often referred to as canonical decomposition, or sometimes Parafac) amounts to finding the global minimum of a coercive polynomial in many variables. In the case of arrays with nonnegative entries, the low-rank approximation problem is well posed. In addition, due to the large dimension of the problem, the decomposition can be rather efficientl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Industrial and Management Optimization

سال: 2022

ISSN: ['1547-5816', '1553-166X']

DOI: https://doi.org/10.3934/jimo.2021154